#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int numFind(vector<int> &data, float num)
{
    int l = 0, r = data.size() - 1;
    int mid = (l + r) / 2;
    while(l <= r)
    {
        if(data[mid] > num)
        {
            r = mid - 1;
        }
        else if(data[mid] < num)
        {
            l = mid + 1;
        }
        mid = (l + r) / 2;
    }
    return l;
}

//数字在排序数组中出现的次数
int GetNumberOfK(vector<int> data, int k)
{
    return numFind(data, k + 0.5) - numFind(data, k - 0.5);
}

void test()
{
}

int main()
{
    test();
    return 0;
}